On Rational Monads and Free Iterative Theories
نویسندگان
چکیده
For every finitary endofunctor H of Set a rational algebraic theory (or a rational finitary monad) R is defined by means of solving all finitary flat systems of recursive equations over H. This generalizes the result of Elgot and his coauthors, describing a free iterative theory of a polynomial endofunctor H as the theory R of all rational infinite trees. We present a coalgebraic proof that R is a free iterative theory on H for every finitary endofunctor H, which is substantially simpler than the previous proof by Elgot et al., as well as our previous proof. This result holds for more general categories than Set.
منابع مشابه
Free Iterative Theories: A Coalgebraic View
Iterative algebraic theories were introduced by Calvin C. Elgot in Elgot (1975) as a concept serving the study of computation (on, say, Turing machines) at a level abstracting from the nature of external memory. The main example presented by Elgot is the theory of rational trees, that is, infinite trees that are solutions of systems of finitary iterative equations. Or, equivalently, that posses...
متن کاملCompletely iterative algebras and completely iterative monads
Completely iterative theories of Calvin Elgot formalize (potentially infinite) computations as solutions of recursive equations. One of the main results of Elgot and his coauthors is that infinite trees form a free completely iterative theory. Their algebraic proof of this result is extremely complicated. We present completely iterative algebras as a new approach to the description of free comp...
متن کاملA Description of Iterative Reflections of Monads
For ideal monads in Set (e. g. the finite list monad, the finite bag monad etc.) we have recently proved that every set generates a free iterative algebra. This gives rise to a new monad. We prove now that this monad is iterative in the sense of Calvin Elgot, in fact, this is the iterative reflection of the given ideal monad. This shows how to freely add unique solutions of recursive equations ...
متن کاملOn second-order iterative monads
B. Courcelle studied algebraic trees as precisely the solutions of all recursive program schemes for a given signature in Set. He proved that the corresponding monad is iterative. We generalize this to recursive program schemes over a given finitary endofunctor H of a ”suitable” category. A monad is called second-order iterative if every guarded recursive program scheme (w.r.t. H) has a unique ...
متن کاملOn Iteratable Endofunctors
Completely iterative monads of Elgot et al. are the monads such that every guarded iterative equation has a unique solution. Free completely iterative monads are known to exist on every iteratable endofunctor H, i. e., one with final coalgebras of all functors H( ) + X. We show that conversely, if H generates a free completely iterative monad, then it is iteratable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 69 شماره
صفحات -
تاریخ انتشار 2002